• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Central Control over Distributed Service Function Path
¿µ¹®Á¦¸ñ(English Title) Central Control over Distributed Service Function Path
ÀúÀÚ(Author) Shenghua Zhai   Jianping An   Dan Li   Julong Lan   Yuxiang Hu  
¿ø¹®¼ö·Ïó(Citation) VOL 14 NO. 02 PP. 0577 ~ 0594 (2020. 02)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.
Å°¿öµå(Keyword) Full-duplex   Two-way relay network   Physical-layer security   Power allocation   Service Function Chaining   Network Function Virtualization   function instantiation   distributed routing   central control  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå